Optimization Problems over Unit-Distance Representations of Graphs
نویسندگان
چکیده
منابع مشابه
Optimization Problems over Unit-Distance Representations of Graphs
We study the relationship between unit-distance representations and the Lovász theta number of graphs, originally established by Lovász. We derive and prove min-max theorems. This framework allows us to derive a weighted version of the hypersphere number of a graph and a related min-max theorem. Then, we connect to sandwich theorems via graph homomorphisms. We present and study a generalization...
متن کاملOptimization Problems in Unit-Disk Graphs
Unit-Disk Graphs (UDGs) are intersection graphs of equal diameter (or unit diameter w.l.o.g.) circles in the Euclidean plane. In the geometric (or disk) representation, each circle is specified by the coordinates of its center. Three equivalent graph models can be defined with vertices representing the circles [18]. In the intersection graph model, two vertices are adjacent if the corresponding...
متن کاملOn -unit distance graphs
We consider a variation on the problem of determining the chromatic number of the Euclidean plane and define the -unit distance graph to be the graph whose vertices are the points of E, in which two points are adjacent whenever their distance is within of 1. For certain values of we are able to show that the chromatic number is exactly seven. For some smaller values we show the chromatic number...
متن کاملUnit Distance Problems
We study some discrete and continuous variants of the following problem of Erdős: given a finite subset P of R or R, what is the maximum number of pairs (p1, p2) with p1, p2 ∈ P and |p1−p2| = 1?
متن کاملProblems of Distance-Regular Graphs
depend only on i, j and h = ∂(x, y), and do not depend on the choices of vertices x and y. The Johnson graphs and the Hamming graphs are distanceregular, and many distance-regular graphs are related to classical geometries. P polynomial association schemes, combinatorial frameworks to investigate codes and/or designs, are naturally associated to them. In this series of seminar talks, we introdu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/3128